The Computational Complexity of Propositional Cirquent Calculus

Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources. Unlike the more traditional proof-theoretic approaches that manipulate tree-like objects (formulas, sequents, etc.), cirquent calculus is based on circuit-style structures called cirquents, in which different "peer" (sibling, cousin, etc.) substructures may share components. It is this resource sharing mechanism to which cirquent calculus owes its novelty (and its virtues). From its inception, cirquent calculus has been paired with an abstract resource semantics. This semantics allows for reasoning about the interaction between a resource provider and a resource user, where resources are understood in the their most general and intuitive sense. Interpreting resources in a more restricted computational sense has made cirquent calculus instrumental in axiomatizing various fundamental fragments of Computability Logic, a formal theory of (interactive) computability. The so-called "classical" rules of cirquent calculus, in the absence of the particularly troublesome contraction rule, produce a sound and complete system CL5 for Computability Logic. In this paper, we investigate the computational complexity of CL5, showing it is $\Sigma_2^p$-complete. We also show that CL5 without the duplication rule has polynomial size proofs and is NP-complete

Natural flow wing

The invention is a natural flow wing and a method for constructing the same. The method comprises contouring a three-dimensional upper surface and a three-dimensional lower surface of the natural flow wing independently of one another into a prescribed shape. Experimental data and theoretical analysis show that flow and pressure-loading over an upper surface of a wing tend to be conical about an apex of the wing, producing favorable and unfavorable regions of performance based on drag. The method reduces these unfavorable regions by shaping the upper surface such that the maximum thickness near a tip of the natural flow wing moves aft, thereby, contouring the wing to coincide more closely with the conical nature of the flow on the upper surface. Nearly constant compressive loading characterizes the flow field over a lower surface of the conventional wing. Magnitude of these compressive pressures on the lower surface depends on angle of attack and on a streamwise curvature of the lower surface of the wing and not on a cross-sectional spanwise curvature. The method, thereby, shapes the lower surface to create an area as large as possible with negative slopes. Any type of swept wing may be used to obtain the final, shaped geometry of the upper and lower surfaces of the natural flow wing

Computable decision making on the reals and other spaces via partiality and nondeterminism

Though many safety-critical software systems use floating point to represent real-world input and output, programmers usually have idealized versions in mind that compute with real numbers. Significant deviations from the ideal can cause errors and jeopardize safety. Some programming systems implement exact real arithmetic, which resolves this matter but complicates others, such as decision making. In these systems, it is impossible to compute (total and deterministic) discrete decisions based on connected spaces such as $\mathbb{R}$. We present programming-language semantics based on constructive topology with variants allowing nondeterminism and/or partiality. Either nondeterminism or partiality suffices to allow computable decision making on connected spaces such as $\mathbb{R}$. We then introduce pattern matching on spaces, a language construct for creating programs on spaces, generalizing pattern matching in functional programming, where patterns need not represent decidable predicates and also may overlap or be inexhaustive, giving rise to nondeterminism or partiality, respectively. Nondeterminism and/or partiality also yield formal logics for constructing approximate decision procedures. We implemented these constructs in the Marshall language for exact real arithmetic.Comment: This is an extended version of a paper due to appear in the proceedings of the ACM/IEEE Symposium on Logic in Computer Science (LICS) in July 201

The natural flow wing-design concept

A wing-design study was conducted on a 65 degree swept leading-edge delta wing in which the wing geometry was modified to take advantage of the naturally occurring flow that forms over a slender wing in a supersonic flow field. Three-dimensional nonlinear analysis methods were used in the study which was divided into three parts: preliminary design, initial design, and final design. In the preliminary design, the wing planform, the design conditions, and the near-conical wing-design concept were derived, and a baseline standard wing (conventional airfoil distribution) and a baseline near-conical wing were chosen. During the initial analysis, a full-potential flow solver was employed to determine the aerodynamic characteristics of the baseline standard delta wing and to investigate modifications to the airfoil thickness, leading-edge radius, airfoil maximum-thickness position, and wing upper to lower surface asymmetry on the baseline near-conical wing. The final design employed an Euler solver to analyze the best wing configurations found in the initial design and to extend the study of wing asymmetry to develop a more refined wing. Benefits resulting from each modification are discussed, and a final 'natural flow' wing geometry was designed that provides an improvement in aerodynamic performance compared with that of a baseline conventional uncambered wing, linear-theory cambered wing, and near-conical wing

Expressing application and network adaptivity : time variations and adaptation paths

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2001.Includes bibliographical references (leaves 45-48).Existing wireless networks provide a wide variety of service capabilities. Due to the inherent nature of wireless transmissions, these services are often characterized by high error rates, variable bandwidths and delays, and unpredictable interruptions. Users and applications are somewhat adaptive in their ability to handle these variable service conditions. However applications are not completely flexible nor does the user perceived quality vary in uniform fashion with the changes in network service. By characterizing flexibility, network service variations and application behaviors can be correlated to improve the QoS provided. To this end, this thesis argues that two new concepts, adaptation paths and time constraints, are important. Adaptation paths specify the ways in which network services and traffic can or do change with time. Time constraints capture aspects of QoS requirements related to time. In particular, two time constraints are introduced. First, a Discernible Service Time (DST) captures the duration for which a level of service must or will be provided before it is changed. Second, Interrupt Time (IT) captures durations for which a particular service may be interrupted for whatever reason. To demonstrate the utility of theses constructs this thesis provides a number of examples for how these extensions can be employed in wireless networks to improve QoS.by Steven J. Bauer.S.M

The Affect of Low Intensity, Progressive, Aerobic Exercise Training on Cardiovascular Function in the Diabetic Rat

A thesis presented to the faculty of the College of Science and Technology at Morehead State University in partial fulfillment of the requirements for the Degree of Masters of Science in Biology by Steven Michael Bauer on August 4, 2000

Philanthropy's New Passing Gear: Mission-Related Investing: A Policy and Implementation Guide for Foundation Trustees

The goal of this guide is to provide foundation trustees and, where or when appropriate, staff with a process to create both an overall policy for MRI as well as specific paths for implementation. Our mission-related investing roadmap outlines how to:Ground a strategy within the values and mission of your foundation;Understand the various catalysts for MRI within a foundation;Structure a policy discussion in the boardroom;Integrate MRI into existing program and investment processes;Link your investment asset allocation with your program goals;Determine the appropriate MRI investment tools and strategies for the foundation;Select appropriate financial, program and investment consultants;Organize the board, and staff and investment consultants to find, evaluate, approve and execute MRI investment vehicles;Monitor investment performance of an MRI portfolio; and ultimatelyIntegrate social returns into the ongoing investment and program decisions of the foundation.We have also included 12 case studies which reflect the diversity of experiences of foundations active in MRI

Generation of the Ares I-X Flight Test Vehicle Aerodynamic Data Book and Comparison To Flight

A 3.5-year effort to characterize the aerodynamic behavior of the Ares I-X Flight Test Vehicle (AIX FTV) is described in this paper. The AIX FTV was designed to be representative of the Ares I Crew Launch Vehicle (CLV). While there are several differences in the outer mold line from the current revision of the CLV, the overall length, mass distribution, and flight systems of the two vehicles are very similar. This paper briefly touches on each of the aerodynamic databases developed in the program, describing the methodology employed, experimental and computational contributions to the generation of the databases, and how well the databases and underlying computations compare to actual flight test results

Measuring the State of ECN Readiness in Servers, Clients, and Routers

Proceedings of the Eleventh ACM SIGCOMM/USENIX Internet Measurement Conference (IMC 2011), Berlin, DE, November 2011.Better exposing congestion can improve traffic management in the wide-area, at peering points, among residential broadband connections, and in the data center. TCP's network utilization and efficiency depends on congestion information, while recent research proposes economic and policy models based on congestion. Such motivations have driven widespread support of Explicit Congestion Notification (ECN) in modern operating systems. We reappraise the Internet's ECN readiness, updating and extending previous measurements. Across large and diverse server populations, we find a three-fold increase in ECN support over prior studies. Using new methods, we characterize ECN within mobile infrastructure and at the client-side, populations previously unmeasured. Via large-scale path measurements, we find the ECN feedback loop failing in the core of the network 40\% of the time, typically at AS boundaries. Finally, we discover new examples of infrastructure violating ECN Internet standards, and discuss remaining impediments to running ECN while suggesting mechanisms to aid adoption

The Growing Complexity of Internet Interconnection

End-to-End (E2E) packet delivery in the Internet is achieved through a system of interconnections between heterogeneous entities called Autonomous Systems (ASes). The initial pattern of AS interconnection in the Internet was relatively simple, involving mainly ISPs with a balanced mixture of inbound and outbound traffic. Changing market conditions and industrial organization of the Internet have jointly forced interconnections and associated contracts to become significantly more diverse and complex. The diversity of interconnection contracts is significant because efficient allocation of costs and revenues across the Internet value chain impacts the profitability of the industry. Not surprisingly, the challenges of recovering the fixed and usage-sensitive costs of network transport give rise to more complex settlements mechanisms than the simple bifurcated (transit and peering) model described in many earlier analyses of Internet interconnection (see BESEN et al., 2001; GREENSTEIN, 2005; or LAFFONT et al., 2003). In the following, we provide insight into recent operational developments, explaining why interconnection in the Internet has become more complex, the nature of interconnection bargaining processes, the implications for cost/revenue allocation and hence interconnection incentives, and what this means for public policy. This paper offers an abbreviated version of the original paper (see FARATIN et al., 2007b).internet interconnection, economics, public policy, routing, peering.